Accuracy versus run time in an adiabatic quantum search
نویسندگان
چکیده
A. T. Rezakhani,1,2,3 A. K. Pimachev,1,2 and D. A. Lidar1,2,4,5 1Department of Chemistry, University of Southern California, Los Angeles, California 90089, USA 2Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA 3Department of Physics, Sharif University of Technology, Tehran, Iran 4Department of Physics, University of Southern California, Los Angeles, California 90089, USA 5Department of Electrical Engineering, University of Southern California, Los Angeles, California 90089, USA (Received 4 August 2010; published 9 November 2010)
منابع مشابه
Finding cliques by quantum adiabatic evolution
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An nvertex random graph has each edge included with probability 1 2 , and a clique is a completely conn...
متن کاملThe role of symmetries in adiabatic quantum algorithms
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions – typically associated with broken or restored symmetries – should be advantageous in comparison to first-order transitions. Guided by simple examples we construct an alternative adiabatic algorithm for the NPcomplete problem Exact Cover 3. We show numerically tha...
متن کاملEntanglement and Adiabatic Quantum Computation
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed. PACS Nos.: 03.67.-a, 03.67.Lx, and 03.67.Mn
متن کاملAdiabatic quantum search algorithm for structured problems
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...
متن کاملHow to Make the Quantum Adiabatic Algorithm Fail
The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N . We show that poor choices for the Hamiltonian can guarantee that the algorithm will not find the minimum if the run time grows more slowly than √ N . These poor choices are nonlocal and wash out any structure in the cost function to be mini...
متن کامل